Finding the Smallest Gap between Sums of Square Roots
نویسندگان
چکیده
Let k and n be positive integers, n > k. Define r(n, k) to be the minimum positive value of | √ a1 + · · ·+ √ ak − √ b1 − · · · − p bk| where a1, a2, · · · , ak, b1, b2, · · · , bk are positive integers no larger than n. It is important to find a tight bound for r(n, k), in connection to the sum-of-square-roots problem, a famous open problem in computational geometry. The current best lower bound and upper bound are far apart. In this paper, we present an algorithm to find r(n, k) exactly in n time and in ndk/2e+o(k) space. As an example, we are able to compute r(100, 7) exactly in a few hours on one PC. The numerical data indicate that the known upper bound seems closer to the truth value of r(n, k).
منابع مشابه
On the minimum gap between sums of square roots of small integers
Let k and n be positive integers, n > k. Define r(n, k) to be the minimum positive value of | √ a1 + · · ·+ √ ak − √ b1 − · · · − √ bk| where a1, a2, · · · , ak, b1, b2, · · · , bk are positive integers no larger than n. Define R(n, k) to be − log r(n, k). It is important to find tight bounds for r(n, k) and R(n, k), in connection to the sum-of-square-roots problem, a famous open problem in com...
متن کاملAn Optimal Bound for Sum of Square Roots of Special Type of Integers∗
The sum of square roots of integers problem is to find the minimum nonzero difference between two sums of square roots of integers. Let r(n,k) denote the minimum nonzero positive value: |∑i=1 √ ai −∑i=1 √ bi|, where ai and bi are positive integers not larger than integer n. We prove by an explicit construction that r(n,k) = O(n−2k+ 3 2 ) for fixed k and any n. Our result implies that in order t...
متن کاملOn Error Sums for Square Roots of Positive Integers with Applications to Lucas and Pell Numbers
Several types of infinite series are considered, which are defined by a fixed real number α and the denominators and numerators of the convergents of α. In this paper we restrict α to the irrational square roots of positive integers. We express the corresponding error sums in terms of a finite number of convergents. It is shown that an error sum formed by convergents with even indices takes onl...
متن کاملLecture 13 : 1 - Center , 1 - Median problems
Given a set of points P = {p1, p2 . . . , pn} ⊂ R, the 1-center problem is to determine the smallest radius ball containing P . Let x be the center of the ball and let r be its radius. We can express the problem of finding the 1-center as the following optimization problem. min r, ||x− pi|| ≤ r ∀i ≤ n In order to avoid computing square roots, we can reformulate the problem as: min r ||x− pi|| ≤...
متن کاملSums of powered characteristic roots count distance-independent circular sets
Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and n ≥ 1 [sic]. We prove that values of Gl(n) are nth power sums of the characteristic roots of the correspond...
متن کامل